a new job scheduling in data grid environment based on data and computational resource availability

data grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. the heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. most existing scheduling algorithms in grids only focus on one kind of grid jobs which can be data-intensive or computation-intensive. however, only considering one kind of jobs in scheduling does not result in suitable scheduling in the viewpoint of all systems, and sometimes causes wasting of resources on the other side. to address the challenge of simultaneously considering both kinds of jobs, a new integrated job scheduling strategy (ijss) is proposed in this paper. at one hand, the ijss algorithm considers both data and computational resource availability of the network, and on the other hand, considering the corresponding requirements of each job, it determines a value called w to the job. using the w value, the importance of two aspects (being data or computation intensive) for each job is determined, and then the job is assigned to the available resources. the simulation results with optorsim show that ijss outperforms comparing to the existing algorithms mentioned in literature as number of jobs increases.